|
In the mathematical field of graph theory, the Dyck graph is a 3-regular graph with 32 vertices and 48 edges, named after Walther von Dyck.〔.〕 It is Hamiltonian with 120 distinct Hamiltonian cycles. It has chromatic number 2, chromatic index 3, radius 5, diameter 5 and girth 6. It is also a 3-vertex-connected and a 3-edge-connected graph. The Dyck graph is a toroidal graph, and the dual of its symmetric toroidal embedding is the Shrikhande graph, a strongly regular graph both symmetric and hamiltonian. ==Algebraic properties== The automorphism group of the Dyck graph is a group of order 192.〔Royle, G. (F032A data )〕 It acts transitively on the vertices, on the edges and on the arcs of the graph. Therefore the Dyck graph is a symmetric graph. It has automorphisms that take any vertex to any other vertex and any edge to any other edge. According to the ''Foster census'', the Dyck graph, referenced as F32A, is the only cubic symmetric graph on 32 vertices.〔.〕 The characteristic polynomial of the Dyck graph is equal to . 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Dyck graph」の詳細全文を読む スポンサード リンク
|